The Complexity of the Maximization of Anytime Contract Algorithms of the Average Quality over a Time Interval
نویسندگان
چکیده
In this report, we restate the problem of maximizing the average quality of an anytime contract algorithm over a time interval, then we present general results about any kind of quality function approximated by a stepwise function. We prove that the problem is NP-hard, but becomes quadratic if the time interval is large enough. This report is associated to the paper published in IJCAI'99 [2] and its main aim is to detail the proofs of the NP-hardness.
منابع مشابه
Maximization of the Average Quality of Anytime Contract Algorithms over a Time Interval
Previous studies considered quality optimization of anytime algorithms by taking into account the quality of the final result. The problem we are interested in is the maximization of the average quality of a contract algorithm over a time interval. We first informally illustrate and motivate this problem with few concrete situations. Then we prove that the problem is NPhard, but quadratic if th...
متن کاملA New Hybrid Method for Web Pages Ranking in Search Engines
There are many algorithms for optimizing the search engine results, ranking takes place according to one or more parameters such as; Backward Links, Forward Links, Content, click through rate and etc. The quality and performance of these algorithms depend on the listed parameters. The ranking is one of the most important components of the search engine that represents the degree of the vitality...
متن کاملUsing and comparing metaheuristic algorithms for optimizing bidding strategy viewpoint of profit maximization of generators
With the formation of the competitive electricity markets in the world, optimization of bidding strategies has become one of the main discussions in studies related to market designing. Market design is challenged by multiple objectives that need to be satisfied. The solution of those multi-objective problems is searched often over the combined strategy space, and thus requires the simultaneous...
متن کاملThe Multidisciplinary Design Optimization of a Reentry Vehicle Using Parallel Genetic Algorithms
The purpose of this paper is to examine the multidisciplinary design optimization (MDO) of a reentry vehicle. In this paper, optimization of a RV based on, minimization of heat flux integral and minimization of axial force coefficient integral and maximization of static margin integral along reentry trajectory is carried out. The classic optimization methods are not applicable here due to the c...
متن کاملParallel Generation of t-ary Trees
A parallel algorithm for generating t-ary tree sequences in reverse B-order is presented. The algorithm generates t-ary trees by 0-1 sequences, and each 0-1 sequences is generated in constant average time O(1). The algorithm is executed on a CREW SM SIMD model, and is adaptive and cost-optimal. Prior to the discussion of the parallel algorithm a new sequential generation with O(1) average time ...
متن کامل